Star-shaped Roadmaps - A Deterministic Sampling Approach for Complete Motion Planning
نویسندگان
چکیده
We present a simple algorithm for complete motion planning using deterministic sampling. Our approach relies on computing a star-shaped roadmap of the free space. We partition the free space into star-shaped regions such that a single point called the guard can see every point in the starshaped region. The resulting set of guards capture the intraregion connectivity. We capture the inter-region connectivity by computing connectors that link guards of adjacent regions. We use the guards and connectors to construct a star-shaped roadmap of the free space. We present an efficient algorithm to compute the roadmap in a deterministic manner without computing an explicit representation of the free space. We show that the star-shaped roadmap captures the connectivity of the free space while providing sufficient information to perform complete motion planning. Our approach is relatively simple to implement for robots with translational and rotational degrees of freedom (dof). We highlight the performance of our algorithm on challenging scenarios with narrow passages or when there is no collision-free path for low-dof robots.
منابع مشابه
A Simple Algorithm for Complete Motion Planning of Translating Polyhedral Robots
We present a new sampling-based algorithm for complete motion planning. Our algorithm relies on computing a star-shaped roadmap of the free space. We partition the free space into star-shaped regions such that a single point, called the guard, can see every point in the star-shaped region. The resulting set of guards capture the intraregion connectivity—the connectivity between points belonging...
متن کاملRegion Roadmap Connection in Parallel Sampling-Based Motion Planning
In today’s society, parallel computing is commonplace. Motion planning is a computationally complex problem in which solution methodologies can exploit parallelism for complex problems. In one approach to parallel sampling-based motion planning, the environment is divided among processors so that roadmaps can be constructed for each region of the environment independently. Afterwards, the roadm...
متن کاملConstructing probabilistic roadmaps with powerful local planning and path optimization
This paper describes a new approach to probabilistic roadmap construction for path planning. The novel feature of the planner is that it uses a powerful local planner to produce highly connected roadmaps and path optimization to maintain the rapid query processing by a fast local operator. While most previous approaches obtain good roadmaps by advanced sampling methods, the presented approach c...
متن کاملCooperative Multi-Robot Sampling-Based Motion Planning with Dynamics
This paper develops an effective, cooperative, and probabilistically-complete multi-robot motion planner. The approach takes into account geometric and differential constraints imposed by the obstacles and the robot dynamics by using sampling to expand a motion tree in the composite state space of all the robots. Scalability and efficiency is achieved by using solutions to a simplified problem ...
متن کاملPath Deformation Roadmaps: Compact Graphs with Useful Cycles for Motion Planning
This paper describes a new approach to sampling-based motion planning with PRMmethods. Our aim is to compute good quality roadmaps that encode the multiple connectedness of the configuration space inside small but yet representative graphs that capture well the different varieties of free paths. The proposed Path Deformation Roadmaps (PDR) rely on a notion of path deformability indicating wheth...
متن کامل